The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
针对通常的串行计算机的串行最短路径算法,几乎已经到达了理论上的时间复杂度极限。
It realizes the functions of the vehicle real-time monitoring, sending and receiving SMS information, the process of alarm, the optimization of shortest path and so on.
实现了车辆的实时监控管理、短消息的收发、车辆报警处理和最短路线选择等功能。
Meanwhile, combining these two ideas, we propose a new kind of single-source shortest path algorithm based on bucket structure, which has good time complexity and parallelism property.
同时,提出了结合这两类算法思想的一种基于桶结构的单源最短路径串行算法,算法具有好的运行时间复杂度和可并行性。
And tomorrow it's recitation, we'll spend quite a bit of time on shortest path problems.
也就是说我们会在最短路径问题上,花上很多时间。
应用推荐